A Robust Optimizing Reverse Logistics Model for Beef Products Using Multi Depot Vehicle Routing Problem

نویسندگان

چکیده

Beef is a perishable product and requires special handling. Demand for beef also fluctuates quite high heavily influenced by various religious events traditions in Indonesia. Under these conditions, reasons, products are returned from customers to distributors. An increase the number of leads costs risk damage. The research created an optimization model distribution recall with minimal risks. applied clustering method using Density-Based Spatial Clustering (DBSCAN) algorithm determine density customers’ locations orders. Optimization distance withdrawal Multi Depot Vehicle Routing Problem (MDVRP) Mixed Integer Linear Programming (MILP) mathematical modeling. results indicate three customer clusters one noise, most potential cluster 1. From this condition, delivery based on shipments two central warehouses. uses MDVRP MILP make company-owned trucks more profitable at rental truck replacement costs. produces robust changes capacity sensitivity analysis.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing

The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...

متن کامل

capacitated multi-depot vehicle routing problem with inter-depot routes

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

متن کامل

periodic vehicle routing problem in reverse logistics with qualified customers

one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

متن کامل

The Multi-Depot Vehicle Routing Problem with Inter-Depot Routes

This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.

متن کامل

A multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ComTech

سال: 2023

ISSN: ['2476-907X', '2087-1244']

DOI: https://doi.org/10.21512/comtech.v14i1.8397